Combinatorial embedding of chain transitive zero-dimensional systems into chaos
نویسندگان
چکیده
منابع مشابه
controlling chaos in 2-dimensional systems
a chaos control method suggested by erjaee has been reviewed. it has been shown that thistechnique can be applied in various evolutionary systems of 2-dimensional types. the method has beenapplied for cases of the henon map, as well as burger’s map. the limitations of the control techniquehave also been discussed by considering the standard map and the gumowski-mira map. the resultsobtained thr...
متن کاملEmbedding Partially Ordered Sets into Chain-products
Embedding partially ordered sets into chain-products is already known to be NP-complete (see Yannakakis 30] for dimension or Stahl and Wille 26] for 2-dimension). In this paper, we introduce a new dimension parameter and show that encoding using terms (or k-dimension) is not better than bit-vector (or 2-dimension) and vice versa. A decomposition theory is introduced using coatomic lattices. An ...
متن کاملEmbedding Chaos
ly: replace external by receiving better: remove external reception actions (= replace it by -actions ) But: transformation may lead to less behavior Unsound! remove all variables (potentially) influenced by , as well (and transitively so) forward slice/cone of influence In SDL: NONE-transitions 19 June 2001 Embedding Chaos Closing the program two steps: 1. Data-flow analysis: mark all variable...
متن کاملEmbedding Hypermedia into Information Systems
This paper discusses the integration of hypermedia as a value-added support functionality into computer-based information systems. These include a large base of scientific and business applications, which people use primarily for their underlying analytic functionality. Hypermedia features supplement these applications, providing access to the application's primary activities, and support for t...
متن کاملEmbedding 3-dimensional Grids into Optimal Hypercubes
The hypercube is a particularly versatile network for parallel computing. It is well-known that 2-dimensional grid machines can be simulated on a hypercube with a small constant communication overhead. We introduce new easily computable functions which embed many 3-dimensional grids into their optimal hypercubes with dilation 2. Moreover, we show that one can reduce the open problem to recogniz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2016
ISSN: 0166-8641
DOI: 10.1016/j.topol.2016.03.014